11,310 research outputs found
Noncrossing Linked Partitions and Large (3,2)-Motzkin Paths
Noncrossing linked partitions arise in the study of certain transforms in
free probability theory. We explore the connection between noncrossing linked
partitions and colored Motzkin paths. A (3,2)-Motzkin path can be viewed as a
colored Motzkin path in the sense that there are three types of level steps and
two types of down steps. A large (3,2)-Motzkin path is defined to be a
(3,2)-Motzkin path for which there are only two types of level steps on the
x-axis. We establish a one-to-one correspondence between the set of noncrossing
linked partitions of [n+1] and the set of large (3,2)-Motzkin paths of length
n. In this setting, we get a simple explanation of the well-known relation
between the large and the little Schroder numbers.Comment: 8 page
The Limiting Distribution of the Coefficients of the -Catalan Numbers
We show that the limiting distributions of the coefficients of the
-Catalan numbers and the generalized -Catalan numbers are normal. Despite
the fact that these coefficients are not unimodal for small , we conjecture
that for sufficiently large , the coefficients are unimodal and even
log-concave except for a few terms of the head and tail.Comment: 13 page
On Balanced Colorings of the n-Cube
A 2-coloring of the n-cube in the n-dimensional Euclidean space can be
considered as an assignment of weights of 1 or 0 to the vertices. Such a
colored n-cube is said to be balanced if its center of mass coincides with its
geometric center. Let be the number of balanced 2-colorings of the
n-cube with 2k vertices having weight 1. Palmer, Read and Robinson conjectured
that for , the sequence is
symmetric and unimodal. We give a proof of this conjecture. We also propose a
conjecture on the log-concavity of for fixed k, and by probabilistic
method we show that it holds when n is sufficiently large.Comment: 10 page
Balanced Properties of the q-Derangement Numbers and the q-Catalan Numbers
Based on Bona's condition for the balanced property of the number of cycles
of permutations, we give a general criterion for the balanced property in terms
of the generating function of a statistic. We show that the q-derangement
numbers and the q-Catalan numbers satisfy the balanced property.Comment: 9 page
Linked Partitions and Permutation Tableaux
Linked partitions are introduced by Dykema in the study of transforms in free
probability theory, whereas permutation tableaux are introduced by
Steingr\'{i}msson and Williams in the study of totally positive Grassmannian
cells. Let . Let denote the set of linked
partitions of with blocks, let denote the set of
permutations of with descents, and let denote the set of
permutation tableaux of length with rows. Steingr\'{i}msson and
Williams found a bijection between the set of permutation tableaux of length
with rows and the set of permutations of with weak
excedances. Corteel and Nadeau gave a bijection from the set of permutation
tableaux of length with columns to the set of permutations of
with descents. In this paper, we establish a bijection between and
and a bijection between and . Restricting the
latter bijection to noncrossing linked partitions, we find that the
corresponding permutation tableaux can be characterized by pattern avoidance.Comment: 11 pages, 9 figure
Families of Sets with Intersecting Clusters
A family of -subsets on is
called a -cluster if the union contains
at most elements with . Let be a family of -subsets
of an -element set. We show that for and , if every
-cluster of is intersecting, then contains
no -dimensional simplices. This leads to an affirmative answer to
Mubayi's conjecture for based on Chv\'atal's simplex theorem. We also
show that for any satisfying and ,
if every -cluster is intersecting, then with equality only when is a complete
star. This result is an extension of both Frankl's theorem and Mubayi's
theorem.Comment: 14 pages; Final version, to appear in SIAM J. Discrete Mat
Partitions of into Arithmetic Progressions
We introduce the notion of arithmetic progression blocks or AP-blocks of
, which can be represented as sequences of the form . Then we consider the problem of partitioning
into AP-blocks for a given difference . We show that subject
to a technical condition, the number of partitions of into
-AP-blocks of a given type is independent of . When we restrict our
attention to blocks of sizes one or two, we are led to a combinatorial
interpretation of a formula recently derived by Mansour and Sun as a
generalization of the Kaplansky numbers. These numbers have also occurred as
the coefficients in Waring's formula for symmetric functions.Comment: 11 pages, 2 figure
Zeta Functions and the Log-behavior of Combinatorial Sequences
In this paper, we use the Riemann zeta function and the Bessel
zeta function to study the log-behavior of combinatorial
sequences. We prove that is log-convex for . As a consequence,
we deduce that the sequence is log-convex, where
is the -th Bernoulli number. We introduce the function
, where is the
gamma function, and we show that is strictly increasing for
. This confirms a conjecture of Sun stating that the sequence
is strictly increasing. Amdeberhan, Moll
and Vignat defined the numbers
and conjectured that the
sequence is log-convex for and . By
proving that is log-convex for and , we show
that the sequence is log-convex for any . We
introduce another function involving and the
gamma function and we show that is strictly
increasing for . This implies that
. Based on
Dobinski's formula, we prove that for
, where is the -th Bell number. This confirms another
conjecture of Sun. We also establish a connection between the increasing
property of and H\"{o}lder's inequality in
probability theory.Comment: 16 pages; to appear in Proc. Edinburgh Math. Soc. (2
Schur Positivity and the -Log-convexity of the Narayana Polynomials
Using Schur positivity and the principal specialization of Schur functions,
we provide a proof of a recent conjecture of Liu and Wang on the
-log-convexity of the Narayana polynomials, and a proof of the second
conjecture that the Narayana transformation preserves the log-convexity. Based
on a formula of Br\"andn which expresses the -Narayana
numbers as the specializations of Schur functions, we derive several symmetric
function identities using the Littlewood-Richardson rule for the product of
Schur functions, and obtain the strong -log-convexity of the Narayana
polynomials and the strong -log-concavity of the -Narayana numbers.Comment: 38 pages, 6 figure
Infinitely Log-monotonic Combinatorial Sequences
We introduce the notion of infinitely log-monotonic sequences. By
establishing a connection between completely monotonic functions and infinitely
log-monotonic sequences, we show that the sequences of the Bernoulli numbers,
the Catalan numbers and the central binomial coefficients are infinitely
log-monotonic. In particular, if a sequence is
log-monotonic of order two, then it is ratio log-concave in the sense that the
sequence is log-concave. Furthermore, we prove
that if a sequence is ratio log-concave, then the sequence
is strictly log-concave subject to a certain
initial condition. As consequences, we show that the sequences of the
derangement numbers, the Motzkin numbers, the Fine numbers, the central
Delannoy numbers, the numbers of tree-like polyhexes and the Domb numbers are
ratio log-concave. For the case of the Domb numbers , we confirm a
conjecture of Sun on the log-concavity of the sequence
.Comment: 26 pages, to appear in Adv. Appl. Mat
- β¦